Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries

نویسندگان

  • Abhishek Mukherji
  • Elke A. Rundensteiner
  • Matthew O. Ward
چکیده

Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams resulting in buffer overflow and uncontrolled data loss. We explore join direction adaptation (JDA) to tackle CPU-limited processing of multijoin stream queries. The existing JDA solutions allocate the scarce CPU resources to the most productive half-way join within a single operator. We instead leverage the operator interdependencies to optimize the overall query throughput. We identify result staleness, typically ignored by most state-of-the-art techniques, as a critical issue in CPU-limited processing. It gets further aggravated if throughput optimizing techniques are employed. We establish the novel path-productivity model and the Freshness predicate. Our proposed JAQPOT approach is the first integrated solution to achieve near optimal query throughput while also guaranteeing freshness satisfiability. JAQPOT runs in quadratic time of the number of streams irrespective of the query plan shape. Our experimental study demonstrates the superiority of JAQPOT in achieving higher throughput than the state-of-the-art JDA strategy while also fulfilling freshness predicates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achieving High Freshness and Optimal Throughput in Resource-Limited Execution of Multi-Join Continuous Queries

Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams resulting in buffer overflow and uncontrolled loss of data. In this work, we explore join direction adaptation (JDA) to tackle resource-limited processing of multi-join stream queries. While the existing JDA solutions alloca...

متن کامل

Adaptive optimization of join trees for multi-join queries over sensor streams

Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sources. These applications perform various operations (e.g. filter, aggregate, join etc) on incoming data streams in real-time according to predefined queries or rules. Since the data rate and data distribution fluctuate...

متن کامل

ARES: an Adaptively Re-optimizing Engine for Stream Query Processing

Applications dealing with continuous streaming data such as sensor data processing, network traffic engineering, network monitoring, intrusion detection, financial monitoring etc are becoming more and more predominant. Such applications have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sources. These applications have...

متن کامل

Optimization of spatial join using constraints based- clustering techniques

Spatial joins are used to combine the spatial objects. The efficient processing depends upon the spatial queries. The execution time and input/output (I/O) time of spatial queries are crucial, because the spatial objects are very large and have several relations. In this article, we use several techniques to improve the efficiency of the spatial join; 1. We use R*-trees for spatial queries sinc...

متن کامل

Multi-Join Continuous Query Optimization: Covering the Spectrum of Linear, Acyclic, and Cyclic Queries

Abstract. Traditional optimization algorithms that guarantee optimal plans have exponential time complexity and are thus not viable in streaming contexts. Continuous query optimizers commonly adopt heuristic techniques such as Adaptive Greedy to attain polynomial-time execution. However, these techniques are known to produce optimal plans only for linear and star shaped join queries. Motivated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011